/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 17655
 * Date: 2025-05-18
 * Time: 20:04
 */
public class test4 {
    public int longestCommonSubsequence(String str1, String str2) {
        int m = str1.length();
        int n = str2.length();
        int[][] dp = new int[m+1][n+1];
        int maxLength = 0;
        int end = 0;

        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                // 判断
                if(str1.charAt(i-1) == str2.charAt(j-1)){
                    // 记录长度
                    dp[i][j] = dp[i-1][j-1] + 1;
                    // 变更长度
                    maxLength = Math.max(dp[i][j],maxLength);
                    end = i-1;
                }else{
                    dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }
}
